A Join Algorithm Utilizing Multiple Path Indexes in Object-Oriented Database Systems
نویسندگان
چکیده
Although various types of path indexes – indexes on path expressions – have been proposed for efficient processing of object-oriented queries, conventional join algorithms do not effectively utilize them. We propose a new join algorithm called OID join algorithm that effectively utilizes (multiple) path indexes in object-oriented databases. When (multiple) path indexes are available for a query, OID join algorithm may reduce the query evaluation cost significantly by taking full advantage of the path indexes. We present cost analysis for OID join algorithm and compare it with those of conventional ones.
منابع مشابه
Query Optimization Techniques Utilizing Path Indexes in Object-Oriented Database Systems
We propose query optimization techniques that fully utilize the advantages ojpath indexes in object-oriented database systems. Although path indexes provide an eficient access to complex objects, little research has been done on query optimization that fully utilize path indexes. We first devise a generalized index intersection technique, adapted to the structure of the path index extended from...
متن کاملQuery Optimization Techniques Utilizing Path Indexesin
We propose query optimization techniques that fully utilize the advantages of path indexes in object-oriented database systems. Although path indexes provide an eecient access to complex objects, little research has been done on query optimization that fully utilize path indexes. We rst devise a generalized index intersection technique, adapted to the structure of the path index extended from c...
متن کاملCost-Controlled OFL Rewriting Rules for Multiple Collection Traversals
The integration of path expression evaluations in an object-oriented cost-driven query optimizer is the subject of this paper. We present rewriting rules that transform path expressions into different object target programs (i.e., query execution plans). An analytical cost model is presented and used to compare the quality of various programs. We have used the OFL (Object Functional Language) t...
متن کاملParallel Sub-Collection Join Algorithm for High Performance Object-Oriented Databases
In Object-Oriented Databases (OODB), although path expression between classes may exist, it is sometimes necessary to perform an explicit join between two or more classes due to the absence of pointer connections or the need for value matching between objects. Furthermore, since objects are not in a normal form, an attribute of a class may have a collection as a domain. Collection attributes ar...
متن کاملOptimizing Object-Oriented Collection Join Queries through Path Traversals
Path traversals have been recognized as one of the strengths of object-oriented query processing as object retrieval can be carried out through pointer navigation. Apart from path traversals, explicit join between objects is sometimes necessary in Object-Oriented Databases (OODB), due to the absence of pointer connections or the need for value matching between objects. Like in Relational Databa...
متن کامل